Binary words excluding a pattern and proper Riordan arrays
نویسندگان
چکیده
منابع مشابه
Binary words excluding a pattern and proper Riordan arrays
We study the relation between binary words excluding a pattern and proper Riordan arrays. In particular, we prove necessary and sufficient conditions under which the number of words counted with respect to the number of zeroes and ones bits are related to proper Riordan arrays. We also give formulas for computing the generating functions (d(x), h(x)) defining the Riordan array.
متن کاملAlgebraic aspects of some Riordan arrays related to binary words avoiding a pattern
We consider some Riordan arrays related to binary words avoiding a pattern which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow us to define every element as a linear combination of other elements in the array; the A-sequence is unique while the A-matrix is not. However, for the problems considered in the present paper, we show that the A-matrix ...
متن کاملGenerating trees and proper Riordan Arrays
16 other words, the ending point is not situated above the main diagonal x = y. When the path never goes above this diagonal, we simply call it an underdiagonal path. Shapiro's paths 8] are another interesting kind of paths. These paths are characterized by the fact that the northeast steps on the main diagonal may have diierent colours from the northeast steps on the other diagonals. In other ...
متن کاملLevel Generating Trees and Proper Riordan Arrays
The concept of generating trees has been introduced in the literature by Chung, Graham, Hoggat and Kleiman in [4] to examine Baxter permutations. This technique has been successfully applied by West [17, 18] to other classes of permutations and more recently to some other combinatorial classes such as plane trees and lattice paths (see Barcucci et al. [2]). In all these cases, a generating tree...
متن کاملGeneralized Riordan arrays
In this paper, we generalize the concept of Riordan array. A generalized Riordan array with respect to cn is an infinite, lower triangular array determined by the pair (g(t), f(t)) and has the generic element dn,k = [t/cn]g(t)(f(t))/ck, where cn is a fixed sequence of non-zero constants with c0 = 1. We demonstrate that the generalized Riordan arrays have similar properties to those of the class...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.07.023